Global EDF scheduling for parallel real-time tasks
نویسندگان
چکیده
منابع مشابه
Global Edf Scheduling for Parallel Real-time Tasks Contents
As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this thesis, we consider the Global Earliest Deadline First (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be represented by a directed acyclic gr...
متن کاملAnalysis of Global EDF for Parallel Tasks
As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. We prove that a Global Earliest Deadline First (GEDF) scheduling policy provides a capacity augmentation bound of 4− 2 m and a resource augmentation bound of 2− 1 m for parallel tasks i...
متن کاملExact Schedulability Test for global-EDF Scheduling of Periodic Hard Real-Time Tasks on Identical Multiprocessors
Over the years, the preemptive periodic constrained-deadline task model [9] has proven remarkably useful for the modeling of recurring processes that occur in hard real-time computer application systems, where the failure to satisfy any constraint may have disastrous consequences. The problem of scheduling such tasks upon a single processor (CPU) so that all the deadlines are met has been widel...
متن کاملReservation-Based Federated Scheduling for Parallel Real-Time Tasks
This paper considers the scheduling of parallel realtime tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federate...
متن کاملReal-Time Scheduling of Linear Speedup Parallel Tasks
In this paper a problem of deterministic scheduling parallel applications in a multiprogrammed multiprocessor system is considered. We address the preemptive case. The number of processors used by a task can change over time. Any task can be executed with linear speedup on a number of processors not greater than some task-dependent constant. This problem can be solved by a low-order polynomial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2014
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-014-9213-9